On Arc-Regular Permutation Groups Using Latin Squares
نویسنده
چکیده
For a given a permutation group G, the problem of determining which regular digraphs admit G as an arc-regular group of automorphism is considered. Groups which admit such a representation can be characterized in terms of generating sets satisfying certain properties, and a procedure to manufacture such groups is presented. The technique is based on constructing appropriate factorizations of (smaller) regular line digraphs by means of Latin squares. Using this approach, all possible representations of transitive groups of degree up to seven as arc-regular groups of digraphs of some degree is presented.
منابع مشابه
Permutation Groups with a Cyclic Regular Subgroup and Arc Transitive Circulants
A description is given of finite permutation groups containing a cyclic regular subgroup. It is then applied to derive a classification of arc transitive circulants, completing the work dating from 1970’s. It is shown that a connected arc transitive circulant of order n is one of the following: a complete graph Kn , a lexicographic product [K̄b], a deleted lexicographic product [K̄b] − b , where ...
متن کاملA constraint on the biembedding of Latin squares
A biembedding of two latin squares of order n is equivalent to a face 2-colourable triangulation of Kn,n,n. We consider the following question: Given two latin squares A and B of order n, is there any relabelling of A and B for which there exists a biembedding? Grannell, Griggs and Knor answered this question computationally for n ≤ 7. A main class of latin squares is a set of latin squares whi...
متن کاملOn the degree of local permutation polynomials∗
Every Latin square of prime or prime power order s corresponds to a polynomial in 2 variables over the finite field on s elements, called the local permutation polynomial. What characterizes this polynomial is that its restrictions to one variable are permutations. We discuss the general form of local permutation polynomials and prove that their total degree is at most 2s−4, and that this bound...
متن کاملOn the Design of Permutation P in DES Type Cryptosystems
This paper reviews some possible design criteria for the permutation P in a DES style cryptosystem. These permutations provide the diffusion component in a substitution-permutation network. Some empirical rules which seem to account for the derivation of the permutation used in the DES are first presented. Then it is noted that these permutations may be regarded as latin-squares which link the ...
متن کاملPermutation Polynomials Modulo w
We give an exact characterization of permutation polynomials mod ulo n w w a polynomial P x a a x adx d with integral coe cients is a permutation polynomial modulo n if and only if a is odd a a a is even and a a a is even We also characterize polynomials de ning latin squares mod ulo n w but prove that polynomial multipermutations that is a pair of polynomials de ning a pair of orthogonal latin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005